﻿/* 7. Write an expression that checks if given positive integer number n (n ≤ 100) is prime.
 * E. g. 37 is prime. */

using System;

public class IsPrime
{
    public static void Main()
    {
        Console.Write("The positive integer n = ");
        uint n = uint.Parse(Console.ReadLine());         
        byte divisors = 1;
        uint counter = 2;
        
        while ((divisors <= 2) && (counter <= n))
        {
            if (n % counter == 0)
                divisors++;

            counter++;
        }

        if (divisors > 2)
            Console.WriteLine("is composite.");
        else if (divisors == 2)
            Console.WriteLine("is prime.");
        else
            Console.WriteLine("is not prime and not composite.");
    }
}